404B - Marathon - CodeForces Solution


implementation math *1500

Please click on ads to support us..

C++ Code:

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <fstream>

using namespace std;

long double a, d, n, x, y, s, l, j;

int main()
{
    cout << fixed << setprecision(7);

    cin >> a >> d >> n;

    l = a * 4;

    for (int i = 0; i < n; i++)
    {
        s = fmod((i + 1) * d, l);

        j = 0;

        while (s - a > 0)
        {
            s -= a, j++;
        }

        if (j == 0) x = s, y = 0;
        else if (j == 1) x = a, y = s;
        else if (j == 2) x = a - s, y = a;
        else x = 0, y = a - s;

        cout << x << " " << y << "\n";
    }

    return 0;
}


Comments

Submit
0 Comments
More Questions

262A - Roma and Lucky Numbers
1634B - Fortune Telling
1358A - Park Lighting
253C - Text Editor
365B - The Fibonacci Segment
75A - Life Without Zeros
1519A - Red and Blue Beans
466A - Cheap Travel
659E - New Reform
1385B - Restore the Permutation by Merger
706A - Beru-taxi
686A - Free Ice Cream
1358D - The Best Vacation
1620B - Triangles on a Rectangle
999C - Alphabetic Removals
1634C - OKEA
1368C - Even Picture
1505F - Math
1473A - Replacing Elements
959A - Mahmoud and Ehab and the even-odd game
78B - Easter Eggs
1455B - Jumps
1225C - p-binary
1525D - Armchairs
1257A - Two Rival Students
1415A - Prison Break
1271A - Suits
259B - Little Elephant and Magic Square
1389A - LCM Problem
778A - String Game